Computing the Permanental Polynomial of a Matrix from a Combinatorial Viewpoint
نویسندگان
چکیده
Recently, in the book [A Combinatorial Approach to Matrix Theory and Its Applications, CRC Press (2009)] the authors proposed a combinatorial approach to matrix theory by means of graph theory. In fact, if A is a square matrix over any field, then it is possible to associate to A a weighted digraph GA, called Coates digraph. Through GA (hence by graph theory) it is possible to express and prove results given for the matrix theory. In this paper we express the permanental polynomial of any matrix A in terms of permanental polynomials of some digraphs related to GA.
منابع مشابه
Computing the Permanental Polynomial of C 60 in Parallel ∗
The permanental polynomial of buckminsterfullerene C60 is computed in parallel in this paper. The basic idea of the method is simply divide-and-conquer to achieve both computational precision and speed. The load balancing strategies for the permanental polynomial computation are further improved with the help of the theory of parallel machine scheduling in combinatorial optimization. The specia...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملComputing the permanental polynomials of bipartite graphs by Pfaffian orientation
The permanental polynomial of a graph G is π(G,x) , per(xI −A(G)). From the result that a bipartite graph G admits an orientation Ge such that every cycle is oddly oriented if and only if it contains no even subdivision of K2,3, Yan and Zhang showed that the permanental polynomial of such a bipartite graph G can be expressed as the characteristic polynomial of the skew adjacency matrix A(Ge). I...
متن کاملDeterminant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these characterizations and show that they tally with we...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کامل